Metamorphosis: State Assignment by Retiming and Re-encoding Category : 2 (sequential Logic Synthesis and Veriication)

نویسنده

  • Balakrishnan Iyer
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improving the Reachability Analysis Technique by Circuit Retiming

Implicit reachable state computation can be applied to a wide range of sequential formal veriication and logic synthesis problems. Symbolic manipulation with BDDs is one of the most eecient techniques known for the reachability analysis. The technique was rst proposed by Coudert et al. in 1989, and was improved later by Touati et al. in 1990. The standard approach chooses the cut of a sequentia...

متن کامل

Scalably-Verifiable Sequential Synthesis

This report is a case-study of the synergy between sequential synthesis and verification. Described is an efficient implementation of a sequential synthesis that uses simple induction to detect and merge sequentially-equivalent registers and nodes in a sequential circuit with a given initial state. Since retiming is not performed, state-encoding, scan chains, and test vectors are essentially pr...

متن کامل

Structure-Driven Equivalence Verification for Circuits Optimized by Retiming and Combinational Synthesis

Sequential optimization techniques fall in two broad categories: state-based and structure-based [4]. Structurebased techniques optimize a circuit netlist by interleaving retiming and combinational synthesis in different ways to improve design metrics such as delay, area, and power. Examples of such optimizations include among others: peripheral retiming [7], architectural retiming [6], and ite...

متن کامل

Sequential Logic Optimization with Implicit Retiming and Resynthesis

This paper introduces a new logic transformation that integrates retiming with algebraic and Boolean transformations at the technology-independent level. It ooers an additional degree of freedom in sequential network optimization resulting from implicit retiming across logic blocks and fanout stems. The application of this transformation to sequential network synthesis results in the optimizati...

متن کامل

Optimal Retiming for Initial State Computation

Retiming is a transformation that optimizes a sequential circuit by relocating the registers. When the circuit has an initial state, one must compute an equivalent initial state for the retimed circuit. In this paper we propose a new efficient retiming algorithm for performance optimization. The retiming determined by the algorithm is the best with respect to initial state computation. It is th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996